Configurations of Locally Strong Coherence in the Presence of Conditional Exchangeability (the case of cardinality k <= 3)
نویسنده
چکیده
Locally strong coherence is an helpful property for inference models based on partial lower-upper conditional probabilities. Moreover, structural constraints are usually adopted to improve vague conclusions. In this paper this two aspects are joint together by proposing logical-numerical conditions that guarantee conditional exchangeability among couples or triplets of events.
منابع مشابه
A Novel Image Denoising Method Based on Incoherent Dictionary Learning and Domain Adaptation Technique
In this paper, a new method for image denoising based on incoherent dictionary learning and domain transfer technique is proposed. The idea of using sparse representation concept is one of the most interesting areas for researchers. The goal of sparse coding is to approximately model the input data as a weighted linear combination of a small number of basis vectors. Two characteristics should b...
متن کاملThe existence of Zak transform in locally compact hypergroups
Let K be a locally compact hypergroup. In this paper we initiate the concept of fundamental domain in locally compact hypergroups and then we introduce the Borel section mapping. In fact, a fundamental domain is a subset of a hypergroup K including a unique element from each cosets, and the Borel section mapping is a function which corresponds to any coset, the related unique element in the fun...
متن کاملOn Conditional Inactivity Time of Failed Components in an (n-k+1)-out-of-n System with Nonidentical Independent Components
In this paper, we study an (n-k+1)-out-of-n system by adopting their components to be statistically independent though nonidentically distributed. By assuming that at least m components at a fixed time have failed while the system is still working, we obtain the mixture representation of survival function for a quantity called the conditional inactivity time of failed components in the system. ...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملSome notes on L-projections on Fourier-Stieltjes algebras
In this paper, we investigate the relation between L-projections and conditional expectations on subalgebras of the Fourier Stieltjes algebra B(G), and we will show that compactness of G plays an important role in this relation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005